Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics
نویسندگان
چکیده
We propose a novel approach for the medial axis approximation of triangulated solids by using a polyhedral unit ball B instead of the standard Euclidean unit ball. By this means we compute the exact medial axis MA(Ω) of a triangulated solid Ω with respect to a piecewise linear (quasi-) metric dB . The obtained representation of Ω by the medial axis transform MAT(Ω) allows for a convenient computation of the trimmed offset of Ω with respect to dB . All calculations are performed within the field of rational numbers, resulting in a robust and efficient implementation of our approach. Adapting the properties of B provides an easy way to control the level of details captured by the medial axis, making use of the implicit pruning at flat boundary features.
منابع مشابه
Medial Residues of Piecewise Linear Manifolds
Skeleton structures of objects are used in a wide variety of applications such as shape analysis and path planning. One of the most widely used skeletons is the medial axis, which is a thin structure centered within and homotopy equivalent to the object. However, on piecewise linear surfaces, which are one of the most common outputs from surface reconstruction algorithms, natural generalization...
متن کاملDistance functions and skeletal representations of rigid and non-rigid planar shapes
Shape skeletons are fundamental concepts for describing the shape of geometric objects, and have found a variety of applications in a number of areas where geometry plays an important role. Two types of skeletons commonly used in geometric computations are the straight skeleton of a (linear) polygon, and the medial axis of a bounded set of points in the k-dimensional Euclidean space. However, e...
متن کاملAccurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky et al. [1]. While the original algorithm is able to compute geodesic distances to isolated points on the mesh only, our generalization can handle arbitrary, possibly open, polygons on the mesh to define the zero set of th...
متن کاملPrecise Hausdorff distance computation between polygonal meshes
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events where the Hausdorff distance may occur, is fully classified. These events include simple cases where foot points of vertices are examined as well as more complicated cases where extreme distance evaluation is needed on t...
متن کاملEfficient Computation of Discrete Voronoi Diagram and Homotopy-Preserving Simplified Medial Axis of a 3D Polyhedron
AVNEESH SUD: Efficient Computation of Discrete Voronoi Diagram and Homotopy-Preserving Simplified Medial Axis of a 3D Polyhedron. (Under the direction of Dinesh Manocha.) The Voronoi diagram is a fundamental geometric data structure and has been well studied in computational geometry and related areas. A Voronoi diagram defined using the Euclidean distance metric is also closely related to the ...
متن کامل